On the Regularization of Mixed Complementarity Problems
نویسنده
چکیده
A variational inequality problem (VIP) satisfying a constraint qual-iication can be reduced to a mixed complementarity problem (MCP). Monotonicity of the VIP implies that the MCP is also monotone. Introducing regularizing perturbations, a sequence of strictly monotone mixed complementarity problems is generated. It is shown that, if the original problem is solvable, the sequence of computable inexact solutions of the strictly monotone MCP's is bounded and every accumulation point is a solution. Under an additional condition on the precision used for solving each subproblem, the sequence converges to the minimum norm solution of the MCP.
منابع مشابه
Hamburger Beitrage zur Angewandten Mathematik Beyond Montonicity in Regularization Methods for Nonlinear Complementarity Problems
Regularization methods for the solution of nonlinear complementarity problems are standard methods for the solution of monotone complementarity problems and possess strong convergence properties. In this paper, we replace the monotonicity assumption by a P0-function condition. We show that many properties of regularization methods still hold for this larger class of problems. However, we also p...
متن کاملBeyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems
Regularization methods for the solution of nonlinear complementarity problems are standard methods for the solution of monotone complementarity problems and possess strong convergence properties. In this paper, we replace the monotonicity assumption by a P0-function condition. We show that many properties of regularization methods still hold for this larger class of problems. However, we also p...
متن کاملA regularization semismooth Newton method based on the generalized Fischer-Burmeister function for P0-NCPs
We consider a regularization method for nonlinear complementarity problems with F being a P0-function which replaces the original problem with a sequence of the regularized complementarity problems. In this paper, this sequence of regularized complementarity problems are solved approximately by applying the generalized Newton method for an equivalent augmented system of equations, constructed b...
متن کاملA Regularization Newton Method for Solving Nonlinear Complementarity Problems
In this paper we construct a regularization Newton method for solving the nonlinear complementarity problem (NCP(F)) and analyze its convergence properties under the assumption that F is a P0-function. We prove that every accumulation point of the sequence of iterates is a solution of NCP(F) and that the sequence of iterates is bounded if the solution set of NCP(F) is nonempty and bounded. More...
متن کاملA Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...
متن کامل